Search results for "stutter equivalence"

showing 1 items of 1 documents

A Detailed Account of The Inconsistent Labelling Problem of Stutter-Preserving Partial-Order Reduction

2021

One of the most popular state-space reduction techniques for model checking is partial-order reduction (POR). Of the many different POR implementations, stubborn sets are a very versatile variant and have thus seen many different applications over the past 32 years. One of the early stubborn sets works shows how the basic conditions for reduction can be augmented to preserve stutter-trace equivalence, making stubborn sets suitable for model checking of linear-time properties. In this paper, we identify a flaw in the reasoning and show with a counter-example that stutter-trace equivalence is not necessarily preserved. We propose a stronger reduction condition and provide extensive new correc…

Model checkingFOS: Computer and information sciencesComputer Science - Logic in Computer ScienceTheoretical computer sciencepartial-order reductionGeneral Computer Sciencestutter equivalenceComputer sciencealgoritmiikkaCorrectness proofsRotation formalisms in three dimensionsTheoretical Computer ScienceLogic in Computer Science (cs.LO)Reduction (complexity)Partial order reductionstubborn setsEquivalence (measure theory)tietojenkäsittelyLTL
researchProduct